Planning as an Iterative Process
نویسنده
چکیده
Activity planning for missions such as the Mars Exploration Rover mission presents many technical challenges, including oversubscription, consideration of time, concurrency, resources, preferences, and uncertainty. These challenges have all been addressed by the research community to varying degrees, but significant technical hurdles still remain. In addition, the integration of these capabilities into a single planning engine remains largely unaddressed. However, I argue that there is a deeper set of issues that needs to be considered – namely the integration of planning into an iterative process that begins before the goals, objectives, and preferences are fully defined. This introduces a number of technical challenges for planning, including the ability to more naturally specify and utilize constraints on the planning process, the ability to generate multiple qualitatively different plans, and the ability to provide deep explanation of plans.
منابع مشابه
Network Planning Using Iterative Improvement Methods and Heuristic Techniques
The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...
متن کاملProduct Development Decision Support System Customer-Based
Quality Function Deployment (QFD) has been traditionally used as a planning tool primarily for product development and quality improvement. In this context, many people have used QFD for making decisions on how to prioritize critical product areas from a customer perspective. However, it is the position of the author that the QFD process can be viewed as a decision support system that would enc...
متن کاملIterative Process for an α- Nonexpansive Mapping and a Mapping Satisfying Condition(C) in a Convex Metric Space
We construct one-step iterative process for an α- nonexpansive mapping and a mapping satisfying condition (C) in the framework of a convex metric space. We study △-convergence and strong convergence of the iterative process to the common fixed point of the mappings. Our results are new and are valid in hyperbolic spaces, CAT(0) spaces, Banach spaces and Hilbert spaces, simultaneously.
متن کاملIterative Approach for Automatic Beam Angle Selection in Intensity Modulated Radiation Therapy Planning
Introduction: Beam-angle optimization (BAO) is a computationally intensive problem for a number of reasons. First, the search space of the solutions is huge, requiring enumeration of all possible beam orientation combinations. For example, when choosing 4 angles out of 36 candidate beam angles, C36 = 58905 possible combinations exist. Second, any change in a beam 4 config...
متن کاملThe Merging of Diverse Perspectives: Management, Customer, and Developer in an Iterative Development Planning Process
This paper addresses the unique views of planning undertaken by management, customers, and developers. The concept of an iteration is briefly presented, along with roles performed by management, customers, and developers in the iterative development process. All of these views map into a hierarchy of plans central to the successful culmination of the iterative project.
متن کامل